Exact Algorithms for NP-Hard Problems: A Survey
نویسنده
چکیده
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.
منابع مشابه
Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time. When dealing with NP-hard problems, algorithms can only be expected to possess at most two out of these three desirable properties. All algorithms presented in this thesis are exact algorithms, which means that they always find...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملProposing a Constrained-GSA for the Vehicle Routing Problem
In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...
متن کاملSome New Techniques in Design and Analysis of Exact (Exponential) Algorithms
This survey concerns techniques in design and analysis of algorithms that can be used to solve NP hard problems faster than exhaustive search algorithms (but still in exponential time). We discuss several of such techniques: Measure & Conquer, Exponential Lower Bounds, Bounded Tree-width, and Memorization. We also consider some extensions of the mentioned techniques to parameterized algorithms.
متن کامل